Graph Transformation for Topology Modelling
نویسندگان
چکیده
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our proposal is motivated by the need of describing specific operations to be done on topological representations of objects in computer graphics, especially for simulation of complex structured systems where rearrangements of compartments are subject to change. We also define application of such meta-rules and prove that it preserves some necessary conditions for G-maps.
منابع مشابه
Towards A Shape Analysis for Graph Transformation Systems
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topologies or reconfigurable software. Being a formal method, graph transformation systems lend themselves to a formal analysis. This has inspired the development of various verification methods, in particular also model chec...
متن کاملRule-based transformations for geometric modelling
The context of this paper is the use of formal methods for topology-based geometric modelling. Topology-based geometric modelling deals with objects of various dimensions and shapes. Usually, objects are defined by a graph-based topological data structure and by an embedding that associates each topological element (vertex, edge, face, etc.) with relevant data as their geometric shape (position...
متن کاملTopology-based Geometric Modelling for Biological Cellular Processes
In this paper, we present a framework to simulate biological cellular processes involving a strong topological and geometric structuration. Our framework is based on topology-based geometric modelling. The edge labels of a graph sub-class, the n-dimensional generalized maps, model the neighbouring relations between biological compartments. Thus, membranes become topological objects of the n-dim...
متن کاملModel-Based Stochastic Simulation of P2P VoIP Using Graph Transformation System
P2P systems are characterised by large-scale distribution and high degree of architectural dynamics caused by their lack of central coordination. In such an environment, it is notoriously hard to guarantee a good quality of service. Simulation can help to validate network designs and protocols, but most existing simulation approaches cannot cope with unbounded dynamic change of network topology...
متن کاملAn Alexandroff topology on graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008